Implicit self-adjusting computation for purely functional programs
نویسندگان
چکیده
منابع مشابه
Implementing Implicit Self-Adjusting Computation
Computational problems that involve dynamic data have been an important subject of study in programming languages. Recent advances in self-adjusting computation have developed techniques that enable programs to respond automatically and efficiently to dynamic changes in their inputs. But these techniques have required an explicit programming style, where the programmer must use specific monadic...
متن کاملProgrammable Self-Adjusting Computation
Self-adjusting computation is a paradigm for programming incremental computations that efficiently respond to input changes by updating the output in time proportional to the changes in the structure of the computation. This dissertation defends the thesis that high-level programming abstractions improve the experience of reading, writing, and reasoning about and the efficiency of self-adjustin...
متن کاملCompiling Self-Adjusting Programs
From 3 February to 8 February 2008, the Dagstuhl Seminar 08061 Types, Logics and Semantics for State was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of sem...
متن کاملCompiling Purely Functional Structured Programs
We present a marriage of functional and structured imperative programming that embeds in pure lambda calculus. We describe how we implement the core of this language in a monadic DSL which is structurally equivalent to our intended source language and which, when evaluated, generates pure lambda terms in continuation-passing-style. 1. Pure Functional Programming One of the frequently touted ben...
متن کاملNon-monotonic Self-Adjusting Computation
Self-adjusting computation is a language-based approach to writing programs that respond dynamically to input changes by maintaining a trace of the computation consistent with the input, thus also updating the output. For monotonic programs, i.e. where localized input changes cause localized changes in the computation, the trace can be repaired efficiently by insertions and deletions. However, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Programming
سال: 2014
ISSN: 0956-7968,1469-7653
DOI: 10.1017/s0956796814000033